A combinatorial derivation of the Poincare' polynomials of the finite irreducible Coxeter groups

نویسنده

  • Rudolf Winkel
چکیده

(1) The Poincar e polynomials of the nite irreducible Coxeter groups and the Poincar e series of the aane Coxeter groups on three generators are derived by an elementary combinatorial method avoiding the use of Lie theory and invariant theory. (2) Non-recursive methods for the computation of`standard reduced words' for (signed) permutations are described. The algebraic basis for both (1) and (2) is a simple partition property of the weak Bruhat order of Coxeter groups into isomorphic parts. The combinatorial properties of weak Bruhat order of Coxeter groups, especially of the nite irreducible and aane ones, have been investigated for quite a time (see for example BW, St] and the references therein). But the partitioning property of the weak Bruhat order of Coxeter groups into isomorphic parts as stated in Theorem 0.1 below | though probably known by the experts | has certainly not been fully exploited. In the present paper we show the usefulness of this partition property by (1) giving a pictorial combinatorial derivation of the Poincar e polynomials and series for the nite irreducible Coxeter groups and the aane Coxeter groups on three generators | results, which until now have been obtained by invariant theoretic or Lie theoretic methods (cf. B, Hu]) | and by (2) deriving simple non-recursive schemes for the computation of standard reduced words for both unsigned and signed permutations. Some of the simplest pictures of the labeled Hasse diagrams in Section 1 have appeared also in connection with Verma modules and Schubert cells GM] and as a graphical device for calculating the homology of the most elementary Artin groups S]. Below in the introduction we recall some well known facts about Coxeter groups, weak Bruhat order, and Poincar e series, and | since we are not aware of any citable source | prove the basic partitioning theorem about the weak Bruhat order of Coxeter groups into order-isomorphic parts. Sections 1 and 3 contain pictures of the labeled Hasse diagrams for those parts of nite Coxeter groups and aane Coxeter groups on three generators, which are induced by the maximal parabolic subgroups with connected sub-Coxeter graphs. These pictures are derived directly from the group relations, and elementary calculations than yield the Poincar e polynomials or series for each of these Coxeter groups.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Primitive derivations, Shi arrangements and Bernoulli polynomials

LetW be a finite irreducible real reflection group, which is a Coxeter group. A primitive derivation D, introduced and studied by K. Saito (e.g., [4]), plays a crucial role in the theory of differential forms with logarithmic poles along the Coxeter arrangement. For example, we may describe the contact order filtration of the logarithmic derivation module using the primitive derivations ([10, 1...

متن کامل

Involutory Reflection Groups and Their Models

A finite subgroup of GL(n,C) is involutory if the sum of the dimensions of its irreducible complex representations is given by the number of absolute involutions in the group. A uniform combinatorial model is constructed for all non-exceptional irreducible complex reflection groups which are involutory including, in particular, all infinite families of finite irreducible Coxeter groups.

متن کامل

Deformations of Coxeter hyperplane arrangements and their characteristic polynomials

Let A be a Coxeter hyperplane arrangement, that is the arrangement of reflecting hyperplanes of an irreducible finite Coxeter group. A deformation of A is an affine arrangement each of whose hyperplanes is parallel to some hyperplane of A. We survey some of the interesting combinatorics of classes of such arrangements, reflected in their characteristic polynomials.

متن کامل

Polynomial Factorization over Finite Fields By Computing Euler-Poincare Characteristics of Drinfeld Modules

We propose and rigorously analyze two randomized algorithms to factor univariate polynomials over finite fields using rank 2 Drinfeld modules. The first algorithm estimates the degree of an irreducible factor of a polynomial from Euler-Poincare characteristics of random Drinfeld modules. Knowledge of a factor degree allows one to rapidly extract all factors of that degree. As a consequence, the...

متن کامل

Orthogonal Matroids

The notion of matroid has been generalized to Coxeter matroid by Gelfand and Serganova. To each pair (W, P) consisting of a finite irreducible Coxeter group W and parabolic subgroup P is associated a collection of objects called Coxeter matroids. The (ordinary) matroids are the special case where W is the symmetric group (the An case) and P is a maximal parabolic subgroup. This generalization o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 239  شماره 

صفحات  -

تاریخ انتشار 2001